Scalarizations for Maximization with Respect to Polyhedral Cones
نویسنده
چکیده
Efficient points are obtained for cone-ordered maximizations in n R using the method of scalarization. Various scalarizations are presented for ordering cones in general and then for the important special case of polyhedral cones. For polyhedral cones, it is shown how to find vectors in the positive dual cone that are needed for a scalarized objective function. Instructive examples are presented.
منابع مشابه
On Optimality Conditions for Maximizations with Respect to Cones
For a Pareto maximization problem defined in infinite dimensions in terms of cones, relationships among several types of maximal elements are noted and optimality conditions are developed in terms of tangent cones.
متن کاملHilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones
We present a hierarchy of covering properties of rational convex cones with respect to the unimodular subcones spanned by the Hilbert basis. For two of the concepts from the hierarchy we derive characterizations: a description of partitions that leads to a natural integer programming formulation for the Hilbert Partition problem, and a characterization of \binary covers" that admits a linear al...
متن کاملOptimality Conditions for Maximizations of Set-Valued Functions
The maximization with respect to a cone of a set-valued function into possibly infinite dimensions is defined, and necessary and sufficient optimality conditions are established. In particular, an analogue of the Fritz John necessary optimality conditions is proved using a notion of derivative defined in terms of tangent cones.
متن کاملAngular analysis of two classes of non - polyhedral convex cones : the point of view of optimization theory ∗
There are three related concepts that arise in connection with the angular analysis of a convex cone: antipodality, criticality, and Nash equilibria. These concepts are geometric in nature but they can also be approached from the perspective of optimization theory. A detailed angular analysis of polyhedral convex cones has been carried out in a recent work of ours. This note focus on two import...
متن کاملPolyhedral Combinatorics of UPGMA Cones
Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm. The partition lattice informs the study of UPGMA trees. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017